Disjunctive languages and compatible orders
نویسندگان
چکیده
منابع مشابه
Languages and monoids with disjunctive identity.dvi
We show that the syntactic monoids of insertion-closed, deletionclosed and dipolar-closed languages are the groups. If the languages are insertionclosed and congruence simple, then their syntactic monoids are the monoids with disjunctive identity. We conclude with some properties of dipolarclosed languages.
متن کاملOn Some Decompositions of r-Disjunctive Languages
Some kinds of decompositions of r-disjunctive languages on an arbitrary alphabet will be investigated. We will show that an f-disjunctive (t-disjunctive) language can be divided into two parts and either one part of them is an f-disjunctive (t-disjunctive) language or both parts are r-disjunctive but not f-disjunctive (t-disjunctive) languages. Finally, a relevant result of H. J. Shyr and S. S....
متن کاملAtoms and partial orders of infinite languages
We determine minimal elements, i.e., atoms, in certain partial orders of factor closed languages under ⊆. This is in analogy to structural Ramsey theory which determines minimal structures in partial orders under embedding. Mathematics Subject Classification. 68R15, 05C55.
متن کاملLanguages and compatible relations on monoids ∗
With every monoid, one can associate various binary relations, in particular the so-called principal quasi-order, principal order and principal congruence. The aim of this paper is to show that any compatible quasiorder, order and congruence can be obtained as an intersection of the corresponding principal relations. The particular case of languages -subsets of free monoids generated by an alph...
متن کاملRegular tree languages and quasi orders
Regular languages were characterized as sets closed with respect to monotone well-quasi orders. A similar result is proved here for tree languages. Moreover, families of quasi orders that correspond to positive varieties of tree languages and varieties of finite ordered algebras are characterized.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1989
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1989230201491